Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
نویسندگان
چکیده
This paper concerns the uniform random generation and the approximate counting of combinatorial structures admitting an ambiguous description. We propose a general framework to study the complexity of these problems and present some applications to specific classes of languages. In particular, we give a uniform random generation algorithm for finitely ambiguous contextfree languages of the same time complexity of the best known algorithm for the unambiguous case. Other applications include a polynomial time uniform random generator and approximation scheme for the census function of (i) languages recognized in polynomial time by one-way nondeterministic auxiliary pushdown automata of polynomial ambiguity and (ii) polynomially ambiguous rational trace languages.
منابع مشابه
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract)
The class of problems involving the random generation of combinatorial structures from a uniform distribution is considered. Uniform generation problems are, in computational difficulty, intermediate between classical existence and counting problems. It is shown that exactly uniform generation of 'efficiently verifiable' combinatorial structures is reducible to approximate counting (and hence, ...
متن کاملRandom Generation and Approximate Counting of Combinatorial Structures
Ad Ilenia, la persona che più di tutte ha cambiato la mia vita. INTRODUCTION Combinatorial counting problems have a long and distinguished history. Apart from their intrinsic interest, they arise naturally from investigations in numerous branches of mathematics and natural sciences and have given rise to a rich and beautiful theory. Ranking problems, which consist in determining the position of...
متن کاملApproximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique based on the simulation of ergodic Markov chains, it is shown that, for self-reducible structures, almost uniform generation is possible in polynomial time provided only that randomised approximate counting to within some arbitrary polynomial factor is possible in polyn...
متن کاملCounting Environments and Closures
Environments and closures are two of the main ingredients of evaluation in lambdacalculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables. In this paper we investigate some dynamic aspects of evaluation in lambda-calculus considering the quantitative, combinatorial properties of environments and clo...
متن کاملGa a a package for the random genera tion of combinatorial structures
Ga a is a computer algebra package that helps counting and drawing random combinatorial structures of various sorts It is an implementation of the calculus developed by Ph Flajolet B Van Cutsem and the author in Given a combinatorial speci cation and an integer n it draws a random object uniformly amongst all size n structures It applies to all decompos able structures either labelled or unlabe...
متن کامل